Introduction to Data Flow Testing with Genetic Algorithm
نویسندگان
چکیده
Control flow diagrams are a keystone in testing the structure of software programs. With the help of control flow between the various components of the program, we can select the test cases in a particular domain. In this paper, we introduced a window-based tool for generating the CFG of a C Program automatically. The data flow testing, i.e., control flow testing depends on all def-use of the variables. So selecting the test cases for a particular data flow diagram is not an easy task. In this paper genetic algorithm has been used to generate the test cases automatically for data flow testing.
منابع مشابه
Optimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...
متن کاملFlow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search
Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...
متن کاملAn Effective Hybrid Genetic Algorithm for Hybrid Flow Shops with Sequence Dependent Setup Times and Processor Blocking
Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...
متن کاملA novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...
متن کاملModeling and Optimization of Fixed-Bed Fischer-Tropsch Synthesis Using Genetic Algorithm
In this paper, modeling and optimization of Fischer-Tropsch Synthesis is considered in a fixed-bed catalytic reactor using an industrial Fe-Cu-K catalyst. A one dimensional pseudo-homogenous plug flow model without axial dispersion is developed for converting syngas to heavy hydrocarbons. The effects of temperature, pressure, H2 to CO ratio in feed stream, and CO molar flow on the mass flow r...
متن کامل